Groups with free regular length functions in Zn
نویسندگان
چکیده
This is the first paper in a series of three where we take on the unified theory of non-Archimedean group actions, length functions and infinite words. Our main goal is to show that group actions on Zn-trees give one a powerful tool to study groups. All finitely generated groups acting freely on R-trees also act freely on some Zn-trees, but the latter ones form a much larger class. The natural effectiveness of all constructions for Zn-actions (which is not the case for R-trees) comes along with a robust algorithmic theory. In this paper we describe the algebraic structure of finitely generated groups acting freely and regularly on Zn-trees and give necessary and sufficient conditions for such actions.
منابع مشابه
Chemical synthesis and characterization of Zn-doped cadmium oxide based nanoparticles: As nanofluids for thermophysical applications
Semiconductor nanoparticles are studied worldwide at present because of their good optical, physical and chemical properties. In this research work, a set of Zn doped cadmium oxide (Cd1-xZnxO1-δ) nanoparticles were synthesized by simple chemical precipitation route. The precursor materials used in this research work were cadmium nitrate and zinc nitrate (as basic materials) and sodium hydroxide...
متن کاملStatic Analysis of Orthotropic Functionally Graded Material Cylinders with Finite Length by a Mesh-Free Method
In this paper static analysis of orthotropic functionally graded material (FGM) cylinders with finite length was carried out by a mesh-free method. MLS shape functions are used for approximation of displacement field in the weak form of equilibrium equation and essential boundary conditions are imposed by transformation method. In this simulation, an ax symmetric model is used. Mechanical prope...
متن کاملRate of Escape of Random Walks on Regular Languages and Free Products by Amalgamation of Finite Groups
We consider random walks on the set of all words over a finite alphabet such that in each step only the last two letters of the current word may be modified and only one letter may be adjoined or deleted. We assume that the transition probabilities depend only on the last two letters of the current word. Furthermore, we consider also the special case of random walks on free products by amalgama...
متن کاملLong n-zero-free sequences in finite cyclic groups
A sequence in the additive group Zn of integers modulo n is called n-zero-free if it does not contain subsequences with length n and sum zero. The article characterizes the n-zero-free sequences in Zn of length greater than 3n/2−1. The structure of these sequences is completely determined, which generalizes a number of previously known facts. The characterization cannot be extended in the same ...
متن کاملLong zero-free sequences in finite cyclic groups
A sequence in an additively written abelian group is called zero-free if each of its nonempty subsequences has sum different from the zero element of the group. The article determines the structure of the zero-free sequences with lengths greater than n/2 in the additive group Zn of integers modulo n. The main result states that for each zero-free sequence (ai) l i=1 of length l > n/2 in Zn ther...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009